Stochastic optimization and worst-case analysis in monetary policy design

In this paper, we examine the cost of insurance against model uncertainty for the Euro area considering four alternative reference models, all of which are used for policy-analysis at the ECB.We find that maximal insurance across this model range in terms of aMinimax policy comes at moderate costs in terms of lower expected performance. We extract priors that would rationalize the Minimax policy from a Bayesian perspective. These priors indicate that full insurance is strongly oriented towards the model with highest baseline losses. Furthermore, this policy is not as tolerant towards small perturbations of policy parameters as the Bayesian policy rule. We propose to strike a compromise and use preferences for policy design that allow for intermediate degrees of ambiguity-aversion.These preferences allow the specification of priors but also give extra weight to the worst uncertain outcomes in a given context. JEL Klassifikation: E52, E58, E6

Portfolio Decisions with Higher Order Moments

In this paper, we address the global optimization of two interesting nonconvex problems in finance. We relax the normality assumption underlying the classical Markowitz mean-variance portfolio optimization model and consider the incorporation of skewness (third moment) and kurtosis (fourth moment). The investor seeks to maximize the expected return and the skewness of the portfolio and minimize its variance and kurtosis, subject to budget and no short selling constraints. In the first model, it is assumed that asset statistics are exact. The second model allows for uncertainty in asset statistics. We consider rival discrete estimates for the mean, variance, skewness and kurtosis of asset returns. A robust optimization framework is adopted to compute the best investment portfolio maximizing return, skewness and minimizing variance, kurtosis, in view of the worst-case asset statistics. In both models, the resulting optimization problems are nonconvex. We introduce a computational procedure for their global optimization.Mean-variance portfolio selection, Robust portfolio selection, Skewness, Kurtosis, Decomposition methods, Polynomial optimization problems

Robust Portfolio Optimization with Derivative Insurance Guarantees

Robust portfolio optimization aims to maximize the worst-case portfolio return given that the asset returns are allowed to vary within a prescribed uncertainty set. If the uncertainty set is not too large, the resulting portfolio performs well under normal market conditions. However, its performance may substantially degrade in the presence of market crashes, that is, if the asset returns materialize far outside of the uncertainty set. We propose a novel robust portfolio optimization model that provides additional strong performance guarantees for all possible realizations of the asset returns. This insurance is provided via optimally chosen derivatives on the assets in the portfolio. The resulting model constitutes a convex second- order cone program, which is amenable to efficient numerical solution. We evaluate the model using simulated and empirical backtests and conclude that it can out- perform standard robust portfolio optimization as well as classical mean-variance optimization.robust optimization, portfolio optimization, portfolio insurance, second order cone programming

Bounding Option Prices Using SDP With Change Of Numeraire

Recently, given the first few moments, tight upper and lower bounds of the no arbitrage prices can be obtained by solving semidefinite programming (SDP) or linear programming (LP) problems. In this paper, we compare SDP and LP formulations of the European-style options pricing problem and prefer SDP formulations due to the simplicity of moments constraints. We propose to employ the technique of change of numeraire when using SDP to bound the European type of options. In fact, this problem can then be cast as a truncated Hausdorff moment problem which has necessary and sufficient moment conditions expressed by positive semidefinite moment and localizing matrices. With four moments information we show stable numerical results for bounding European call options and exchange options. Moreover, A hedging strategy is also identified by the dual formulation.moments of measures, semidefinite programming, linear programming, options pricing, change of numeraire

Worst-Case Value-at-Risk of Non-Linear Portfolios

Portfolio optimization problems involving Value-at-Risk (VaR) are often computationally intractable and require complete information about the return distribution of the portfolio constituents, which is rarely available in practice. These difficulties are further compounded when the portfolio contains derivatives. We develop two tractable conservative approximations for the VaR of a derivative portfolio by evaluating the worst-case VaR over all return distributions of the derivative underliers with given first- and second-order moments. The derivative returns are modelled as convex piecewise linear or - by using a delta-gamma approximation - as (possibly non-convex) quadratic functions of the returns of the derivative underliers. These models lead to new Worst-Case Polyhedral VaR (WCPVaR) and Worst-Case Quadratic VaR (WCQVaR) approximations, respectively. WCPVaR is a suitable VaR approximation for portfolios containing long positions in European options expiring at the end of the investment horizon, whereas WCQVaR is suitable for portfolios containing long and/or short positions in European and/or exotic options expiring beyond the investment horizon. We prove that WCPVaR and WCQVaR optimization can be formulated as tractable second-order cone and semidefinite programs, respectively, and reveal interesting connections to robust portfolio optimization. Numerical experiments demonstrate the benefits of incorporating non-linear relationships between the asset returns into a worst-case VaR model.Value-at-Risk, Derivatives, Robust Optimization, Second-Order Cone Programming, Semidefinite Programming

Robust Resource Allocations in Temporal Networks

Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations. In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem of selecting an ‘optimal’ resource allocation, where optimality is measured by network characteristics such as the makespan (i.e., the time required to complete all tasks). In this paper, we study a robust resource allocation problem where the functional relationship between task durations and resource assignments is uncertain, and the goal is to minimise the worst-case makespan. We show that this problem is generically NP-hard. We then develop convergent bounds for the optimal objective value, as well as feasible allocations whose objective values are bracketed by these bounds. Numerical results provide empirical support for the proposed method.Robust Optimisation, Temporal Networks, Resource Allocation Problem

Stochastic Optimization and Worst-Case Analysis in Monetary Policy Design

In this paper we compare expected loss minimization to worst-case or minimax analysis in the design of simple Taylor-style rules for monetary policy using a small model estimated for the euro area by Orphanides and Wieland (2000). We find that rules optimized under a minimax objective in the presence of general parameter and shock uncertainty do not imply extreme policy activism. Such rules tend to obey the Brainard principle of cautionary policymaking in much the same way as rules derived by expected loss minimization. Rules derived by means of minimax analysis are effective insurance policies imiting maximum loss over ranges of parameter values to be set by the policy maker. In practice, we propose to set these ranges with an eye towards the cost of such insurance cover in terms of the implied increase in expected inflation variability.Worst-case analysis, robust control, minimax, monetary policy rules, euro area

Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems

We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite relaxations that possess the same kind of sparsity. We aim at solving the former relaxations with a decompositionbased method, which partitions the relaxations according to their sparsity pattern. The decomposition-based method that we propose is an extension to semidefinite programming of the Benders decomposition for linear programs [3] .Polynomial optimization, Semidefinite programming, Sparse SDP relaxations, Benders decomposition

Mean variance optimization of non-linear systems and worst-case analysis

In this paper, we consider expected value, variance and worst-case optimization of nonlinear models. We present algorithms for computing optimal expected values, and variance, based on iterative Taylor expansions. We establish convergence and consider the relative merits of policies beaded on expected value optimization and worst-case robustness. The latter is a minimax strategy and ensures optimal cover in view of the worst-case scenario(s) while the former is optimal expected performance in a stochastic setting. Both approaches are used with a macroeconomic policy model to illustrate relative performances, robustness and trade-offs between the strategies. Klassifikation: C61, E4

Partitioning Procedure for Polynomial Optimization: Application to Portfolio Decisions with Higher Order Moments

We consider the problem of finding the minimum of a real-valued multivariate polynomial function constrained in a compact set defined by polynomial inequalities and equalities. This problem, called polynomial optimization problem (POP), is generally nonconvex and has been of growing interest to many researchers in recent years. Our goal is to tackle POPs using decomposition. Towards this goal we introduce a partitioning procedure. The problem manipulations are in line with the pattern used in the Benders decomposition [1], namely relaxation preceded by projection. Stengle’s and Putinar’s Positivstellensatz are employed to derive the so-called feasibility and optimality constraints, respectively. We test the performance of the proposed method on a collection of benchmark problems and we present the numerical results. As an application, we consider the problem of selecting an investment portfolio optimizing the mean, variance, skewness and kurtosis of the portfolio.Polynomial optimization, Semidefinite relaxations, Positivstellensatz, Sum of squares, Benders decomposition, Portfolio optimization